How to Boost Revenues in FPAs? The Magic of Disclosing only Winning bids from Past Auctions

نویسندگان

  • Philippe Jehiel
  • Peter Katuščák
  • Fabio Michelucci
چکیده

We show that an auctioneer (such as an auction house, or a procurement agency) should disclose historical information about winning bids from past auctions, as opposed to disclosing all bids, because this induces bidders to bid more, and raises revenues. We provide a theoretical explanation for our experimental findings based on a bias: at least some subjects may miss that winning bids are not representative of all bids when processing the available information about past bids.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How to Boost Revenues in First-Price Auctions? The Magic of Disclosing Only Winning Bids from Past Auctions

A long-term auctioneer who repeatedly sells identical or similar items might disclose selective information about past bidding. We present an experimental design to evaluate the revenue implications of two common policies: disclosure of all past bids versus winning bids only. The analysis of our data points out that disclosing winning bids dominates in terms of revenue generation. We propose th...

متن کامل

Rent Seeking with Regretful Agents: Theory and Experiment

We investigate both theoretically and experimentally the role that information disclosure has on behavior in all pay environments in which all agents must exert costly effort, but only the winner is rewarded. Through the lens of all pay auctions, we show that bidders who have regret concerns when they lose an auction may alter their bids. Whether or not information about the winning bid is disc...

متن کامل

Combinatorial reverse auction based on revelation of Lagrangian multipliers

Recently, researchers have proposed decision support tool for generating suggestions for bids in combinatorial reverse auction based on disclosure of bids. An interesting issue is to design an effective mechanism to guide the bidders to collectively minimize the overall cost without explicitly disclosing the bids. We consider a winner determination problem for combinatorial reverse auction and ...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

Carrier Bidding Strategies for Iterative Auctions for Transportation Services

Transportation service procurement auctions are typically characterized by limited number of rounds and low profit margin. In this paper we address the bid determination problem for single-lane and combinatorial bids in the successive rounds of an auction, which maximizes the profit and also ensures winning. A profit factor (PF) is computed at each round using the industry average price for thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014